Semantic Paramodulation for Horn Sets
نویسندگان
چکیده
We present a new strategy for semantic paramodulation for Horn sets and prove its completeness The strategy requires for each paramoduiation that either both parents be false positive units or that one parent and the paramodulant both be false relative to an interpretation We also discuss some of the issues involved in choosing an interpretation that has a chance of giving better performance that simple set-of-support paramoduiation.
منابع مشابه
Category-based Semantic Paramodulation
We introduce the concept of semantic paramodulation as a \semantic" de nition of paramodulation (in the sense that it applies to any model, not only to the term algebra) within the framework of category-based equational logic (introduced by [8, 9]). This not only generalises the traditional syntactic approaches to paramodulation, but also provides an abstract framework for a uni ed treatment of...
متن کاملBasic Paramodulation and Decidable Theories (Extended Abstract)
We prove that for sets of Horn clauses saturated under basic paramodulation, the word and uniiabil-ity problems are in NP, and the number of minimal uniiers is simply exponential (i). For Horn sets saturated wrt. a special ordering under the more restrictive inference rule of basic superposition, the word and uniiability problems are still decidable and uniication is nitary (ii). We deene stand...
متن کاملDecidability and Complexity Analysis by Basic Paramodulation
It is shown that for sets of Horn clauses saturated under basic paramodulation the word and unifiability problems are in NP, and the number of minimal unifiers is simply exponential (i). For Horn sets saturated w.r.t. a special ordering under the more restrictive inference rule of basic superposition, the word and unifiability problems are still decidable and unification is finitary (ii). These...
متن کاملThe Blossom of Finite Semantic Trees
Automated deduction in first-order logic finds almost all its roots in Herbrand’s work, starting with Herbrand’s interpretations, a clausal calculus, and rules for unification. J.A. Robinson’s key contribution was the formulation of resolution and its completeness proof, in which semantic trees were semi-apparent. Robinson and Wos introduced the specific treatment of equality commonly called pa...
متن کاملWell-Foundedness Is Sufficient for Completeness of Ordered Paramodulation
For many years all known completeness results for Knuth-Bendix completion and ordered paramodulation required the term ordering to be well-founded, monotonic and total(izable) on ground terms. Then, it was shown that well-foundedness and the subterm property were enough for ensuring completeness of ordered paramodulation. Here we show that the subterm property is not necessary either. By using ...
متن کامل